Fast Template Placement for Reconfigurable Computing Systems
نویسندگان
چکیده
منابع مشابه
Speeding up Online Placement for XILINX FPGAs by Reducing Configuration Overhead
Recent generations of FPGAs allow run-time partial reconfiguration. To increase the efficacy of reconfigurable computing, multitasking on FPGAs is proposed. One of the challenging problems in multitasking systems is online template placement. In this paper, we describe how existing algorithms work, and propose a new multi-stage method for mapping of tasks to reconfigurable hardware. Also a new ...
متن کاملImplementation of VlSI Based Image Compression Approach on Reconfigurable Computing System - A Survey
Image data require huge amounts of disk space and large bandwidths for transmission. Hence, imagecompression is necessary to reduce the amount of data required to represent a digital image. Thereforean efficient technique for image compression is highly pushed to demand. Although, lots of compressiontechniques are available, but the technique which is faster, memory efficient and simple, surely...
متن کاملFast placement and routing by extending coarse-grained reconfigurable arrays with Omega Networks
Reconfigurable computing architectures are commonly used for accelerating applications and/or for achieving energy savings. However, most reconfigurable computing architectures suffer from computationally demanding placement and routing (P&R) steps. This problem may disable their use in systems requiring dynamic compilation (e.g., to guarantee application portability in embedded systems). Beari...
متن کاملFast Navigation-Placement Tree Algorithm For Reconfigurable Computing System
Due to its potential to greatly accelerate a wide variety of applications, reconfigurable computing has become a subject of a great deal of research. In this paper, we explore the representation models of 1D routing structure and 2D routing structure, we also focus on the task scheduling that targets these representation models. A fast navigation-placement tree algorithm is proposed to formulat...
متن کاملLinear Placement for Static / Dynamic Reconfiguration in JBits
Placement of functional units on an FPGA fabric is a challenging problem for runtime reconfigurable computing systems. We introduce the concept of physical contexts to greatly reduce the complexity of the placement and routing problems. We have implemented static and dynamic linear placement methods for expression trees placed in physical contexts. Our placement algorithms are implemented in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Design & Test of Computers
دوره 17 شماره
صفحات -
تاریخ انتشار 2000